Modal Logics with Weak Forms of Recursion: PSPACE Specimens
نویسنده
چکیده
We analyze the computational complexity of extensions of the multimodal version of the standard modal logic K by finite addition of axiom schemes that can be read as the production rules of a formal grammar. By using proof-theoretical means, we show that every right linear grammar logic has a satisfiability problem in deterministic exponential time and we exhibit countably infinite classes of right linear grammar logics that contain weak forms of recursion for which the satisfiability problem can be solved in polynomial space.
منابع مشابه
Complexity Results for Some Logics of Inconsistent Belief
Modal logics of knowledge have been used to represent and reason about such varied topics as distributed and multi-agent systems, security protocols, and interactive proof systems. We investigate a class of modal logics for representing agents or systems with imperfect or inconsistent knowledge. These logics replace the usual closure under full conjunction for the ¤ operator with progressively ...
متن کاملComplexity results for logics of local reasoning and inconsistent belief
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning inconsistent knowledge and logical omniscience. We investigate a class of related modal logics. These logics replace the usual closure under full conjunction for the ¤ operator with progressively weaker versions, and comprise a ...
متن کاملCoalgebraic Hybrid Logic
We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybr...
متن کاملOn PSPACE-decidability in Transitive Modal Logics
In this paper we describe a new method, allowing us to prove PSPACE-decidability for transitive modal logics. We apply it to L1 and L2, modal logics of Minkowski spacetime. We also show how to extend this method to some other transitive logics.
متن کاملOn the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide class of relevant logics: Many important subclasses of modal logics can be obtained by restricting the allowed models with first-order Horn formulas. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000